Relationship between Alternating omega-Automata and Symbolically Represented Nondeterministic omega-Automata
نویسندگان
چکیده
There is a well known relationship between alternating automata on finite words and symbolically represented nondeterministic automata on finite words. This relationship is of practical relevance because it allows to combine the advantages of alternating and symbolically represented nondeterministic automata on finite words. However, for infinite words the situation is unclear. Therefore, this work investigates the relationship between alternating ω-automata and symbolically represented nondeterministic ω-automata. Thereby, we identify classes of alternating ω-automata that are as expressive as DETG, DETF and DETPrefix automata, respectively. Moreover, some very simple symbolic nondeterminisation procedures are developed for the classes corresponding to DETG and DETF.
منابع مشابه
{\omega}-Automata
This paper gives a concise introduction into the basic theory of ω-automata (as of March 2014). The starting point are the different types of recurrence conditions, modes of operation (deterministic, nondeterministic, alternating automata), and directions (forward or backward automata). The main focus is on fundamental automata constructions, for instance, for boolean operations, determinizatio...
متن کاملEfficient Algorithms for Handling Nondeterministic Automata
Finite (word, tree, or omega) automata play an important role in different areas of computer science, including, for instance, formal verification. Often, deterministic automata are used for which traditional algorithms for important operations such as minimisation and inclusion checking are available. However, the use of deterministic automata implies a need to determinise nondeterministic aut...
متن کاملSeminator: A Tool for Semi-Determinization of Omega-Automata
We present a tool that transforms nondeterministic ω-automata to semi-deterministic ω-automata. The tool Seminator accepts transition-based generalized Büchi automata (TGBA) as an input and produces automata with two kinds of semi-determinism. The implemented procedure performs degeneralization and semi-determinization simultaneously and employs several other optimizations. We experimentally ev...
متن کاملApplications of a group in general fuzzy automata
Let $tilde{F}=(Q,S,tilde{R},Z,omega,tilde{delta}, F_1,F_2)$ be a general fuzzy automaton and the set of its states be a group. The aim of this paper is the study of applications of a group in a general fuzzy automaton. For this purpose, we define the concepts of fuzzy normal kernel of a general fuzzy automaton, fuzzy kernel of a general fuzzy automaton, adjustable, multip...
متن کاملFamilies of DFAs as Acceptors of omega-Regular Languages
Families of dfas (fdfas) provide an alternative formalism for recognizing ωregular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the MyhillNerode theorem for regular languages. This correlation is beneficial for learning algorithms, and indeed it was recently shown that ω-regular langu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005